An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container

This paper addresses the equal circle packing problem, and proposes an efficient Quasi-physical Quasi-human (QPQH) algorithm. QPQH is based on a modified Broyden-Fletcher-GoldfarbShanno (BFGS) algorithm which we call the local BFGS and a new basin hopping strategy based on a Chinese idiom: alternate tension with relaxation. Starting from a random initial layout, we apply the local BFGS algorith...

متن کامل

An Efficient Quasi-physical Algorithm for Packing Equal Circles in a Circular Container

This paper addresses the equal circle packing problem, and proposes an efficient quasi-physical algorithm(EQPA). EQPA is based on an improved BFGS algorithm and a new basin hopping strategy. Starting form a random initial pattern, we use the modified BFGS algorithm to reach a local minimum pattern. The modified BFGS algorithm fully utilizes the neighborhood information and considerably speeds u...

متن کامل

Solving the problem of packing equal and unequal circles in a circular container

In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles within a circular container with minimum radius. Extensive computational experiments have been performed both to analyze the problem at hand, and to choose in an appropriate way the parameter values for the proposed metho...

متن کامل

New heuristics for packing unequal circles into a circular container

We propose two new heuristics to pack unequal circles into a two dimensional circular container. The first one, denoted by A1.0, is a basic heurisitc which selects the next circle to place according to the maximal hole degree rule. The second one, denoted by A1.5, uses a self lookahead strategy to improve A1.0. We evaluate A1.0 and A1.5 on a series of instances up to 100 circles from the litera...

متن کامل

An Efficient Quasi-Human Heuristic Algorithm for Solving the Rectangle-Packing Problem

Rectangle-packing problem involves many industrial applications. For example, in shipping industry, various size boxes have to be loaded as many as possible in a larger container. In wood or glass industries, rectangular components have to be cut from large sheets of material. In very large scale integration (VLSI) floor planning, various chips have to be laid on the chip board, and so on. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2018

ISSN: 0305-0548

DOI: 10.1016/j.cor.2017.12.002